Clique in 3-track interval graphs is APX-hard
نویسنده
چکیده
Butman, Hermelin, Lewenstein, and Rawitz proved that CLIQUE in t-interval graphs is NP-hard for t ≥ 3. We strengthen this result to show that CLIQUE in 3-track interval graphs is APX-hard.
منابع مشابه
Combinatorial Problems on H-graphs
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. We continue the study of these graph classes by considering coloring, clique, and isomorphism problems on H-graphs. We show that for any fixed H conta...
متن کاملMAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that n...
متن کاملMaximum Clique and Minimum
In an alternative approach to \characterizing" the graph class of visibility graphs of simple polygons, we study the problem of nding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that no ...
متن کاملOn the complexity of edge-colored subgraph partitioning problems in network optimization
Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network optimization. Recently, labeled network optimization over colored graphs has been extensively studied. Given a (not necessarily properly) edge-colored gr...
متن کاملParameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
We show that the problem k-DOMINATING SET and its several variants including k-CONNECTED DOMINATING SET, k-INDEPENDENT DOMINATING SET, and k-DOMINATING CLIQUE, when parameterized by the solution size k, are W[1]-hard in either multiple-interval graphs or their complements or both. On the other hand, we show that these problems belong to W[1] when restricted to multipleinterval graphs and their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.2202 شماره
صفحات -
تاریخ انتشار 2010